Dimension Reduction of Health Data Clustering

نویسندگان

  • Rahmat Widia Sembiring
  • Jasni Mohamad Zain
  • Abdullah Embong
چکیده

The current data tends to be more complex than conventional data and need dimension reduction. Dimension reduction is important in cluster analysis and creates a smaller data in volume and has the same analytical results as the original representation. A clustering process needs data reduction to obtain an efficient processing time while clustering and mitigate curse of dimensionality. This paper proposes a model for extracting multidimensional data clustering of health database. We implemented four dimension reduction techniques such as Singular Value Decomposition (SVD), Principal Component Analysis (PCA), Self Organizing Map (SOM) and FastICA. The results show that dimension reductions significantly reduce dimension and shorten processing time and also increased performance of cluster in several health datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals

In this work, we revisit fast dimension reduction approaches, as with random projections and random sampling. Our goal is to summarize the data to decrease computational costs and memory footprint of subsequent analysis. Such dimension reduction can be very efficient when the signals of interest have a strong structure, such as with images. We focus on this setting and investigate feature clust...

متن کامل

Effective Dimension Reduction Techniques for Text Documents

Frequent term based text clustering is a text clustering technique, which uses frequent term set and dramatically decreases the dimensionality of the document vector space, thus especially addressing: very high dimensionality of the data and very large size of the databases. Frequent Term based Clustering algorithm (FTC) has shown significant efficiency comparing to some well known text cluster...

متن کامل

High Dimensional Data Clustering through Efficient Evolutionary Algorithm

Dimensionality reduction is essential in multidimensional data mining since the dimensionality of real time data could easily extend to higher dimensions. Most recent efforts on dimensionality reduction, however, are not adequate for multidimensional data due to lack of scalability. In this paper, we use the evolutionary algorithm for the dimension reduction process. Initially, our proposed evo...

متن کامل

Alternative Model for Extracting Multidimensional Data Based-On Comparative Dimension Reduction

In line with the technological developments, the current data tends to be multidimensional and high dimensional, which is more complex than conventional data and need dimension reduction. Dimension reduction is important in cluster analysis and creates a new representation for the data that is smaller in volume and has the same analytical results as the original representation. To obtain an eff...

متن کامل

An interactive visual testbed system for dimension reduction and clustering of large-scale high-dimensional data

Many of the modern data sets such as text and image data can be represented in high-dimensional vector spaces and have benefited from computational methods that utilize advanced computational methods. Visual analytics approaches have contributed greatly to data understanding and analysis due to their capability of leveraging humans’ ability for quick visual perception. However, visual analytics...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1110.3569  شماره 

صفحات  -

تاریخ انتشار 2011